Equivalence of compositional expressions and independence relations in compositional models

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Persegrams of Compositional Models Revisited: conditional independence

The paper gives instructions how to read conditional independence relations for multidimensional probability distributions represented in a form of a compositional model.

متن کامل

Probabilistic compositional models: Solution of an equivalence problem

Probabilistic compositional models, similarly to graphical Markov models, are able to represent multidimensional probability distributions using factorization and closely related concept of conditional independence. Compositional models represent an algebraic alternative to the graphical models. The system of related conditional independencies is not encoded explicitly (e.g. using a graph) but ...

متن کامل

Compositional Failure-based Equivalence of Constraint Automata

Reo is a coordination language for modeling component connectors of component-based computing systems. Constraint automaton, as an extension of finite automaton, has been proposed as the operational semantics of Reo. In this paper, we introduce an extended definition of constraint automaton by which, every constraint automaton can be considered as a labeled transition system and each labeled tr...

متن کامل

Integrative Priming of Compositional and Locative Relations

Integrative priming refers to the facilitated recognition of a target word (bench) as a real word following a prime (park). Prior integrative priming studies have used a wide variety of integrative relations including temporal (summer rain), topical (travel book), locative (forest river), and compositional (peach pie) relations. Yet differences in the types of integrative relations may yield di...

متن کامل

Greedy Compositional Clustering for Unsupervised Learning of Hierarchical Compositional Models

This paper proposes to integrate a feature pursuit learning process into a greedy bottom-up learning scheme. The algorithm combines the benefits of bottom-up and top-down approaches for learning hierarchical models: It allows to induce the hierarchical structure of objects in an unsupervised manner, while avoiding a hard decision on the activation of parts. We follow the principle of compositio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kybernetika

سال: 2014

ISSN: 0023-5954,1805-949X

DOI: 10.14736/kyb-2014-3-0322